Search results for "time windows"
showing 10 items of 35 documents
Birth Mode-Related Differences in Gut Microbiota Colonization and Immune System Development.
2018
<b><i>Background:</i></b> The process of early gut colonization is extremely variable among individuals and is influenced by numerous factors. Among these, the mode of birth will strongly shape the early microbial exposure and immune environment of the neonate. <b><i>Summary:</i></b> Here, I review how the concomitant processes of microbiota and immune system development are altered by C-section delivery and the effects of such alterations on long-term health. <b><i>Key messages:</i></b> C-section delivery impinges on microbiota and immune system development through various means: (i) if labor is lacking, intrauterine i…
Fostering Poststroke Recovery: Towards Combination Treatments.
2016
Despite countless experimental studies demonstrating neuroprotective effects in the treatment of acute ischemic stroke, they all could not live up their promises when it came to translation into patients. Recent research therefore increasingly shifted to therapies enhancing poststroke recovery with the important advantage of a much wider time window up to several months. To further increase poststroke recovery, the combination of different therapy principles is a logical step. However, several burning questions concerning the modus of combination are unresolved. This review will briefly mention the principle poststroke recovery approaches and discuss the mostly used combination designs. In …
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
2019
The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW hav…
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
2019
In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: At each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a m…
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
2019
This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortes…
Minimal Stabilization Time for Ultra-short Heart Rate Variability Measurements in Professional Soccer
2020
The main aims of this study were: 1) to compare 1-minute RMSSD measurements using different stabilization times between them and also with the criterion; and 2) to determine the agreement between every 1-minute RMSSD measurement with the criterion in professional soccer players. Seven hundred eighteen HRV measurements from professional soccer players were taken. HRV was calculated from 5 to 10 minutes (criterion) and from 1-minute windows with different pre-stabilization times. Friedman and post-hoc tests were applied to compare 1-minute and criterion measurements. Effect size was considered to describe magnitude of change. To determine agreement, Spearman’s correlation was applied, and Bla…
Neural networks for analysing the relevance of input variables in the prediction of tropospheric ozone concentration
2006
Abstract This paper deals with tropospheric ozone modelling by using Artificial Neural Networks (ANNs). In this study, ambient ozone concentrations are estimated using surface meteorological variables and vehicle emission variables as predictors. The work is especially focused on analysing the importance of the input variables used by these models. This analysis is carried out in different time windows: all the time of study (April of 1997, 1999 and 2000), one month (April 1999), and finally, an hourly analysis. All the information extracted from these analyses can determine the most important factors in tropospheric ozone formation, thus achieving a qualitative model from the quantitative …
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
2019
Abstract In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows and (constant) travel times. Second, we show that, if the special conditions do not hold, the time-independent optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. Finally, a branch-and-bound algorithm is presented and tested on a set of 4800 instances. The results have been compared…
Routing electric vehicles with a single recharge per route
2020
Networks : an international journal (2020). doi:10.1002/net.21964
An optimization approach for communal home meal delivery service
2009
Abstract: This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.